/*Hefei 2008-2009 Triangles 
 to count the numbers of red-blue triangles and green-blue triangles.
 ÌÝÐÎÆÊ·Öo(n^3)
*/
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
#define maxn 110
struct Nodes{
	int x,y;
}r[maxn],g[maxn],b[maxn];
int nr,ng,nb;
int below[maxn][maxn][2];
int hav[maxn][2];
bool cmp(Nodes aa,Nodes bb)
{
	if(aa.x!=bb.x)return aa.x<bb.x;
	return aa.y<bb.y;
}
int main()
{
	int i,j,k;
	int ans1,cnt1,t,cnt2,ans2;
	int cas=0;
	double tmp;
	while(scanf("%d%d%d",&nr,&ng,&nb)){
		if(nr==-1&&ng==-1&&nb==-1)break;
		for(i=1;i<=nr;i++){
			scanf("%d%d",&r[i].x,&r[i].y);
		}
		for(i=1;i<=ng;i++){
			scanf("%d%d",&g[i].x,&g[i].y);
		}
		for(i=1;i<=nb;i++){
			scanf("%d%d",&b[i].x,&b[i].y);
		}
		sort(b+1,b+nb+1,cmp);
		for(i=1;i<=nb;i++){
			hav[i][0]=hav[i][1]=0;
			for(j=1;j<=nr;j++){
				if(b[i].x==r[j].x&&r[j].y<b[i].y)
					hav[i][0]++;
			}
			for(j=1;j<=ng;j++){
				if(b[i].x==g[j].x&&g[j].y<b[i].y)
					hav[i][1]++;
			}
		}
		for(i=1;i<=nb;i++){
			for(j=i+1;j<=nb;j++){
				below[i][j][0]=0;
				below[i][j][1]=0;
				if(b[i].x==b[j].x)continue;
				for(k=1;k<=nr;k++){
					if(r[k].x>b[i].x&&r[k].x<b[j].x){
						tmp=(b[j].y-b[i].y)*(r[k].x-b[i].x)*1.0/(b[j].x-b[i].x)+b[i].y;
						if(tmp>r[k].y)below[i][j][0]++;
					}
				}
				for(k=1;k<=ng;k++){
					if(g[k].x>b[i].x&&g[k].x<b[j].x){
						tmp=(b[j].y-b[i].y)*(g[k].x-b[i].x)*1.0/(b[j].x-b[i].x)+b[i].y;
						if(tmp>g[k].y)below[i][j][1]++;
					}
				}
			}
		}
		ans1=ans2=0;
		for(i=1;i<=nb;i++){
			for(j=i+1;j<=nb;j++){
				for(k=j+1;k<=nb;k++){
					cnt1=cnt2=0;
					tmp=(b[k].y-b[i].y)*(b[j].x-b[i].x)*1.0/(b[k].x-b[i].x)+b[i].y;	
					if(tmp<b[j].y){
						cnt1=below[i][j][0]+below[j][k][0]-below[i][k][0]+hav[j][0];
						cnt2=below[i][j][1]+below[j][k][1]-below[i][k][1]+hav[j][1];
						if(cnt1<cnt2)ans2++;
						if(cnt1>cnt2)ans1++;
					}else{
						cnt1=-below[i][j][0]-below[j][k][0]+below[i][k][0]-hav[j][0];
						cnt2=-below[i][j][1]-below[j][k][1]+below[i][k][1]-hav[j][1];
						if(cnt1<cnt2)ans2++;
						if(cnt1>cnt2)ans1++;
					}
				}
			}
		}
		cas++;
		printf("Case %d: %d %d\n",cas,ans1,ans2); 
	}
	return 0;
}